Solving a large scale radiosity problem on GPU-based parallel computers
نویسندگان
چکیده
The radiosity equation has been usedwidely in computer graphics and thermal engineering applications. The equation is simple to formulate but is challenging to solve when the number of Lambertian surfaces associatedwith an application becomes large. In this paper, we present the algorithms to compute the view factors and solve the set of radiosity equations using an out-of-core Cholesky decomposition method. This work details the algorithmic procedures of the computation of the view factors and the Cholesky solver. The data layout of the radiosity matrix follows the block cyclic decomposition scheme used in ScaLAPACK. The parallel computation of the view factors on the GPUs extends the algorithms based on a serial community code called view3d. To handle large matrices that exceed the device memory on GPU, an out-of-core algorithm for parallel Cholesky factorization is implemented. A performance study conducted on Keeneland, a hybrid CPU/GPU cluster at the National Institute for Computational Sciences, composed of 264 nodes of multicore CPU and GPU are shown and discussed. © 2014 Elsevier B.V. All rights reserved.
منابع مشابه
Solving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm
In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...
متن کاملSolving knapsack problems on GPU
A parallel implementation via CUDA of the dynamic programming method for the knapsack problem on NVIDIA GPU is presented. A GTX 260 card with 192 cores (1.4 GHz) is used for computational tests and processing times obtained with the parallel code are compared to the sequential one on a CPU with an Intel Xeon 3.0 GHz. The results show a speedup factor of 26 for large size problems. Furthermore, ...
متن کاملA New Compromise Decision-making Model based on TOPSIS and VIKOR for Solving Multi-objective Large-scale Programming Problems with a Block Angular Structure under Uncertainty
This paper proposes a compromise model, based on a new method, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. In this compromise programming method, two concepts are considered simultaneously. First of them is that the optimal ...
متن کاملMulti-GPU implementation of the lattice Boltzmann method
The lattice Boltzmann method (LBM) is an increasingly popular approach for solving fluid flows in a wide range of applications. The LBM yields regular, data-parallel computations; hence, it is especially well fitted to massively parallel hardware such as graphics processing units (GPU). Up to now, though, single-GPU implementations of the LBM are of moderate practical interest since the on-boar...
متن کامل1 An Environment - Projection Approach to Radiosity for Mesh - Connected Computers
We describe a progressive re nement radiosity algorithm for highly-parallel meshconnected SIMD or MIMD computers. The technique is based on environmentprojection and scales easily to large machines and datasets. Form-factor computations can be performed using local communication by mapping the single-plane across the processor mesh. We report on the performance of an implementation on the MasPa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Computational Applied Mathematics
دوره 270 شماره
صفحات -
تاریخ انتشار 2014